Separation Property for wB- and wS-regular Languages
نویسندگان
چکیده
منابع مشابه
Separation Property for wB- and wS-regular Languages
In this paper we show that ωBand ωS-regular languages satisfy the following separation-type theorem If L1, L2 are disjoint languages of ω-words both recognised by ωB(resp. ωS)automata then there exists an ω-regular language Lsep that contains L1, and whose complement contains L2. In particular, if a language and its complement are recognised by ωB(resp. ωS)automata then the language is ω-regula...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملThe separation problem for regular languages by piecewise testable languages
Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem for regular languages. We then give a direct polynomial time algorithm to check whether two given regular languages are separable by a piecewise testable la...
متن کاملRegular geodesic languages and the falsification by fellow traveler property
We furnish an example of a finite generating set for a group that does not enjoy the falsification by fellow traveler property, while the full language of geodesics is regular. AMS Classification 20F65; 20F10, 68Q80
متن کاملSynchronized Shuue and Regular Languages Synchronized Shuue and Regular Languages
New representation results for three families of regular languages are stated, using a special kind of shuue operation, namely the synchronized shuue. First, it is proved that the family of regular star languages is the smallest family containing the language (a + bc) and closed under synchronized shuue and length preserving morphism. The second representation result states that the family of "...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2014
ISSN: 1860-5974
DOI: 10.2168/lmcs-10(1:8)2014